Restricted size Ramsey number for P3 versus cycle
نویسندگان
چکیده
منابع مشابه
Restricted size Ramsey number for P 3 versus cycles
Let F , G and H be simple graphs. We say F → (G,H) if for every 2-coloring of the edges of F there exists a monochromatic G orH in F . The Ramsey number r(G,H) is defined as r(G,H) = min{|V (F )| : F → (G,H)}, while the restricted size Ramsey number r(G,H) is defined as r(G,H) = min{|E(F )| : F → (G,H), |V (F )| = r(G,H)}. In this paper we determine previously unknown restricted size Ramsey num...
متن کاملRestricted size Ramsey number for path of order three versus graph of order five
Let G and H be simple graphs. The Ramsey number r(G,H) for a pair of graphs G and H is the smallest number r such that any red-blue coloring of the edges of Kr contains a red subgraph G or a blue subgraph H . The size Ramsey number r̂(G,H) for a pair of graphs G and H is the smallest number r̂ such that there exists a graph F with size r̂ satisfying the property that any red-blue coloring of the e...
متن کاملThe Ramsey Number r(K5-P3,K5)
For two given graphs G1 and G2, the Ramsey number r(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Km denote a complete graph of order m and Kn −P3 a complete graph of order n without two incident edges. In this paper, we prove that r(K5 − P3,K5) = 25 without help of computer algorithms.
متن کاملThe Size-ramsey Number
The size-Ramsey number of a graph G is the smallest number of edges in a graph Γ with the Ramsey property for G, that is, with the property that any colouring of the edges of Γ with two colours (say) contains a monochromatic copy of G. The study of size-Ramsey numbers was proposed by Erdős, Faudree, Rousseau, and Schelp in 1978, when they investigated the size-Ramsey number of certain classes o...
متن کاملThe Size Ramsey Number
Let i2 denote the class of all graphs G which satisfy G-(Gl, GE). As a way of measuring r inimality for members of P, we define the Size Ramsey number ; We then investigate various questions concerned with the asymptotic behaviour of r .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Graph Theory and Applications
سال: 2020
ISSN: 2338-2287
DOI: 10.5614/ejgta.2020.8.2.12